Depth Space Collision Detection for Motion Planning
نویسندگان
چکیده
Depth maps are an efficient representation of 3D free space. Encoding distance-to-camera in each pixel permits a dense, regular 2D representation of the space between a camera and the scenery it observes, which may be inspected to fulfill a useful class of object collision queries. In the proposed method, candidate poses of arbitrary 3D geometry are rendered into a depth map with depth testing as a fast way of determining if the geometry is fully contained by the free space implicitly encoded in the depth map. For efficiency, raw depth maps representing a spatial discretization of the world are transformed into a discretization of the configuration space of collision geometry elements. The result is a collision checker that requires 0.4% of the memory and 56% of the CPU resources used by an existing high-performance distance field 3D collision checker.
منابع مشابه
A New Method for Mapping the Configuration Space Obstacles of Polygons
Configuration space (C-space) plays an important role not only in motion planning but also in geometric modeling, shape and kinematic reasoning, and is fundamental to several basic geometric operations, such as continuous collision detection and generalized penetration depth estimation, that also find their applications in motion planning, animation and simulation. In this paper, we developed a...
متن کاملA Novel Method For Fast Collision Detection on the PR2
In the current robot motion planning pipeline for Willow Garage’s PR2 robot, inefficient collision detection algorithms present a bottleneck. This paper provides background information, proposes a new, more efficient method for quickly determining whether a robot is in collision with its environment and gives a basic outline of the implementation process. The new method treats the PR2 robot as ...
متن کاملCurrent Issues in Sampling-Based Motion Planning
In this paper, we discuss the field of sampling-based motion planning. In contrast to methods that construct boundary representations of configuration space obstacles, sampling-based methods use only information from a collision detector as they search the configuration space. The simplicity of this approach, along with increases in computation power and the development of efficient collision d...
متن کاملReal-Time Reach Planning for Animated Characters Using Hardware Acceleration
We present a heuristic-based real-time reach planning algorithm for virtual human figures. Given the start and goal positions in a 3D workspace, our problem is to compute a collision-free path that specifies all the configurations for a human arm to move from the start to the goal. Our algorithm consists of three modules: spatial search, inverse kinematics, and collision detection. For the sear...
متن کاملFast, three-dimensional, collision-free motion planning
Issues dealing with fast, 3-D, collision-free motion planning are discussed, and a fast path planning system under developnlent at NBS i s described. The components of a general motion planner are outlined, and some of their computational aspects are discussed. It is argued that an octree representation of the obstacles in the world leads to fast path planning algorithms. The system we are deve...
متن کامل